搜索资源列表
queen
- 对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered
qqq
- 很常见的N皇后问题，用矩阵的形式画除图， 1表示皇后的位置-Very common N-Queens problem, a matrix in the form of paintings, inter diagram 1 that the location of the Queen
NQueensBacktracking.java
- 解决n-queens using blind search-solving n-queens using blind search
N_QUEENS
- n-queens问题,目前最佳的解法为法国人pion所写-n-queens
zuiniudeNhuanghousuanfa
- 用位操作实现的求解N皇后问题，算法效率很高-Using bit operations to achieve the solution of N Queens problem, the algorithm very efficient
NQueens
- 经典的N皇后问题的实现，使用的算法是回溯法-Classic implementation of N-Queens problem, using the algorithm is backtracking
Queen
- 使用递归算法解决n皇后问题，可供初学递归者参考-The use of a recursive algorithm to solve the n queens problem, for beginners who refer to the recursive
nqueens.c.tar
- n-queens algorithm source code
Queens
- 程序功能：1.由n2个方块排成n行n列的正方形称为n元棋盘。 如果两个皇后位于n元棋盘上的同一行、同一列或同一对角线上，则称它们在互相攻击。 现要找出使棋盘上n个皇后互不攻击的布局。 2.编制程序解决上述问题， 用户输入0～30间的棋盘方阵，给出所有解决方案，并输出结果。 -queens of different table sizes
nQueens
- 使用C语言解决n皇后问题，包括递归和非递归的实现源码。运行环境：Linux,g-Using the C language to solve n queens problem, including the recursive and non-recursive implementation of source code. Runtime Environment: Linux, gcc
nqueensquestion
- 可以对n皇后问题进行全面的实现，求出n皇后有多少种解法-N queens problem can be to achieve a comprehensive, calculate how many kinds of solution n Queen
Queen
- Queen，用回溯法递归方法实现n皇后问题-Queen, with backtracking recursive method to achieve n queens problem
queue
- n皇后问题，解决n皇后的排列问题，仅限于较小的数值情况下-n queens problem, to solve the arrangement of n queen problem, limited to a smaller value cases
NQueen
- N皇后问题的人工求解和自动求解实现，有详细的课件。-N Queens Problem Solving manual and automatic solving to achieve, detailed courseware.
test
- N Queens Code developed in VC-N Queens Code developed in VC++
NQueen
- N皇后问题，可以设置皇后个数，很简单的实现，适合初学者学习。-N queens problem, you can set the number of the Queen, very simple to achieve, for beginners to learn.
NQueen5
- 搜索算法－N皇后问题的自动求解搜索算法－N皇后问题的自动求解-Search algorithm-N Queens Problem-N automatic search algorithm for solving the problem of automatically solving Queen
nhuanghou0-1beibao
- N皇后问题和背包问题的详细解释，PPT内容非常好。包括算法分析，时间复杂度-N Queens problem and knapsack problem explained in detail, PPT content is very good. Including the algorithm analysis, complexity, etc.
Nqueensproblem
- 题目说明： 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。 题目要求： （１）依次输出各种成功的放置方法。 （２）最好能画出棋盘的图形形式，并动态的演示试探过程。 （３）程序能方便的移植到其它规格的棋盘上。 -Title Descr iption: In an N × N chess board in place N queens, so that the N-Queen can not eat each other to be each
nqueens
- 本程序实现的是回溯法解决N皇后问题，并且还有图形化显示。-Implementation of this program is backtracking to solve N Queens problem, and also displayed graphically.